Acid–base transport model depicting the dynamic pH response of interfacial reactions

Acid–base transport is integral to many important interfacial reactions in various fields of chemistry, but its theoretical foundation is lacked. Herein, a common acid–base transport model is established owing to the success in deriving buffer transport equations. This model is applicable to most buffer systems by flexibly integrating the transport equations in terms of buffer components, and is verified through the model relationships of buffer transport limiting current by using hydrogen evolution reaction experiments. Based on model calculations, two diagram approaches are proposed to depict the dynamic pH response and aid buffer operation optimizations. The model and methods allow us to quantify the rate-limiting effect of acid–base transport on interfacial reactions and to precisely control the effect through medium regulations. Furthermore, the model has laid the foundation of dynamic pH effect on species transformation and process mechanism, which can be of wide interest in the chemistry encompassing interfacial reactions.     

基于QoE感知的星地一体化网络公平资源分配策略

星地一体化网络是卫星网络和地面网络互联，实现卫星网络和地面网络优势互补的一体化网络。随着无线通信的快速发展，卫星网络和地面网络的同频复用技术可有效提升资源利用效率，满足日益增长的无线数据业务需求。但由于无线数据业务类型的多样化和频谱资源的稀缺性，如何实现用户数据服务的服务体验质量（Quality of experience， QoE）和公平性提升也成为星地一体化网络亟待解决的关键问题。本文综合考虑信道时变性、服务体验多样性和服务公平性，提出了一种基于QoE感知的星地一体化网络资源分配策略。为此，将目标问题描述为基于时间平均的服务体验质量的网络公平效用最大化，并利用李雅普诺夫优化理论，将复杂的动态原始优化问题进一步转化并分解为3个瞬时优化子问题，每个子问题可以在每个时隙独立求解。同时，由于无线资源分配为典型的非凹混合组合优化问题，推导了一个低复杂度的两步算法来求解第三个资源分配子问题。仿真结果揭示了在不同的公平性参数下用户的长时QoE与公平性之间的折衷情况。     

基于Prophet人工智能算法的网络潮汐效应预测研究

本文使用Prophet人工智能算法研究与预测移动通信网络“潮汐效应”现象，探索网络“潮汐效应”在优化网络资源配置实现网络降本增效的作用。Prophet人工智能算法是一种简单、有效，且易于实现的人工智能算法。通过facebook的人工智能开源框架fbprophet，研究4G网络PRB利用率等网络资源指标的“潮汐效应”，并预测这些网络资源指标在未来的变化趋势，用来指导当前4G网络减容、扩容和4/5G节电节能等，实现优化网络资源配置达到降本增效的目的。     

移动边缘计算环境下的动态资源分配策略

在通讯设备爆炸式增长的时代,移动边缘计算作为5G通讯技术的核心技术之一,对其进行合理的资源分配显得尤为重要。移动边缘计算的思想是把云计算中心下沉到基站部署(边缘云),使云计算中心更加靠近用户,以快速解决计算资源分配问题。但是,相对于大型的云计算中心,边缘云的计算资源有限,传统的虚拟机分配方式不足以灵活应对边缘云的计算资源分配问题。为解决此问题,提出一种根据用户综合需求变化的动态计算资源和频谱分配算法(DRFAA),采用"分治"策略,并将资源模拟成"流体"资源进行分配,以寻求较大的吞吐量和较低的传输时延。实验仿真结果显示,动态计算资源和频谱分配算法可以有效地降低用户与边缘云之间的传输时延,也可以提高边缘云的吞吐量。     

Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect

This article addresses the no-wait flowshop scheduling problem with simultaneous consideration of common due date assignment, convex resource allocation and learning effect in a two machine setting. The processing time of each job can be controlled by its position in a sequence and also by allocating extra resource, which is a convex function of the amount of a common continuously divisible resource allocated to the job. The objective is to determine the optimal common due date, the resource allocation and the schedule of jobs such that the total earliness, tardiness and common due date cost (the total resource consumption cost) are minimized under the constraint condition that the total resource consumption cost (the total earliness, tardiness and common due date cost) is limited. Polynomial time algorithms are developed for two versions of the problem.     

Compound fault-tolerant attitude control for hypersonic vehicle with reaction control systems in reentry phase

In this paper, a novel compound fault-tolerant attitude control (FTC) scheme is proposed for reentry hypersonic vehicles with aerodynamic surfaces and reaction control systems (RCS) in the presence of parameter uncertainties, external disturbances and aerodynamic surfaces faults. Aerodynamic surfaces work as the primary actuators and RCS serve as auxiliary actuators. When aerodynamic surfaces cannot provide the required attitude control torque due to low dynamic pressure or faults, RCS are activated to assist aerodynamic surfaces to generate the residual torque. A nonlinear disturbance observer-based sliding mode controller is designed to calculate the required attitude control torque which can handle the parametric uncertainties and external disturbances together. The quadratic programming method is applied to obtain the optimal aerodynamic surfaces deflections from the required control torque. An innovative fuzzy rule-based decision-making system is design to solve the RCS control allocation problem, which is conceptually easy to understand and computationally efficiently compared with existing approaches. Based on quantized control theory, the closed-loop control system stability is rigorously analyzed. Simulation results are given to demonstrate the effectiveness and efficiency of developed FTC scheme.     

A Dynamic Memory Allocation Optimization Mechanism Based on Spark

Spark is a distributed data processing framework based on memory. Memory allocation is a focus question of Spark research. A good memory allocation scheme can effectively improve the efficiency of task execution and memory resource utilization of the Spark. Aiming at the memory allocation problem in the Spark2.x version, this paper optimizes the memory allocation strategy by analyzing the Spark memory model, the existing cache replacement algorithms and the memory allocation methods, which is on the basis of minimizing the storage area and allocating the execution area according to the demand. It mainly including two parts: cache replacement optimization and memory allocation optimization. Firstly, in the storage area, the cache replacement algorithm is optimized according to the characteristics of RDD Partition, which is combined with PCA dimension. In this section, the four features of RDD Partition are selected. When the RDD cache is replaced, only two most important features are selected by PCA dimension reduction method each time, thereby ensuring the generalization of the cache replacement strategy. Secondly, the memory allocation strategy of the execution area is optimized according to the memory requirement of Task and the memory space of storage area. In this paper, a series of experiments in Spark on Yarn mode are carried out to verify the effectiveness of the optimization algorithm and improve the cluster performance.